Minimization of multi-penalty functionals by alternating iterative thresholding and optimal parameter choices
نویسندگان
چکیده
Inspired by several recent developments in regularization theory, optimization, and signal processing, we present and analyze a numerical approach to multipenalty regularization in spaces of sparsely represented functions. The sparsity prior is motivated by the largely expected geometrical/structured features of high-dimensional data, which may not be well-represented in the framework of typically more isotropic Hilbert spaces. In this paper, we are particularly interested in regularizers which are able to correctly model and separate the multiple components of additively mixed signals. This situation is rather common as pure signals may be corrupted by additive noise. To this end, we consider a regularization functional composed by a data-fidelity term, where signal and noise are additively mixed, a non-smooth and non-convex sparsity promoting term, and a penalty term to model the noise. We propose and analyze the convergence of an iterative alternating algorithm based on simple iterative thresholding steps to perform the minimization of the functional. By means of this algorithm, we explore the effect of choosing different regularization parameters and penalization norms in terms of the quality of recovering the pure signal and separating it from additive noise. For a given fixed noise level numerical experiments confirm a significant improvement in performance compared to standard one-parameter regularization methods. By using high-dimensional data analysis methods such as principal component analysis, we are able to show the correct geometrical clustering of regularized solutions around the expected solution. Eventually, for the compressive sensing problems considered in our experiments we provide a guideline for a choice of regularization norms and parameters. Inverse Problems Inverse Problems 30 (2014) 125003 (34pp) doi:10.1088/0266-5611/30/12/125003 0266-5611/14/125003+34$33.00 © 2014 IOP Publishing Ltd Printed in the UK 1
منابع مشابه
Minimization of Transformed L1 Penalty: Closed Form Representation and Iterative Thresholding Algorithms
The transformed l1 penalty (TL1) functions are a one parameter family of bilinear transformations composed with the absolute value function. When acting on vectors, the TL1 penalty interpolates l0 and l1 similar to lp norm (p ∈ (0, 1)). In our companion paper, we showed that TL1 is a robust sparsity promoting penalty in compressed sensing (CS) problems for a broad range of incoherent and cohere...
متن کاملTransformed Schatten-1 Iterative Thresholding Algorithms for Matrix Rank Minimization and Applications
We study a non-convex low-rank promoting penalty function, the transformed Schatten-1 (TS1), and its applications in matrix completion. The TS1 penalty, as a matrix quasi-norm defined on its singular values, interpolates the rank and the nuclear norm through a nonnegative parameter a∈ (0,+∞). We consider the unconstrained TS1 regularized low-rank matrix recovery problem and develop a fixed poin...
متن کاملChange detection from satellite images based on optimal asymmetric thresholding the difference image
As a process to detect changes in land cover by using multi-temporal satellite images, change detection is one of the practical subjects in field of remote sensing. Any progress on this issue increase the accuracy of results as well as facilitating and accelerating the analysis of multi-temporal data and reducing the cost of producing geospatial information. In this study, an unsupervised chang...
متن کاملAn efficient iterative thresholding method for image segmentation
Abstract. We proposed an efficient iterative thresholding method for multi-phase image segmentation. The algorithm is based on minimizing piecewise constant Mumford-Shah functional in which the contour length (or perimeter) is approximated by a non-local multi-phase energy. The minimization problem is solved by an iterative method. Each iteration consists of computing simple convolutions follow...
متن کاملSubspace Correction Methods for Total Variation and 1-Minimization
This paper is concerned with the numerical minimization of energy functionals in Hilbert spaces involving convex constraints coinciding with a semi-norm for a subspace. The optimization is realized by alternating minimizations of the functional on a sequence of orthogonal subspaces. On each subspace an iterative proximity-map algorithm is implemented via oblique thresholding, which is the main ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014